Toric Newton Method for Polynomial Homotopies
نویسندگان
چکیده
منابع مشابه
Toric Newton Method for Polynomial Homotopies
This paper deenes a generalization of Newton's method to deal with solution paths de-ned by polynomial homotopies that lead to extremal values. Embedding the solutions in a toric variety leads to explicit scaling relations between coeecients and solutions. Toric Newton is a symbolic-numeric algorithm where the symbolic pre-processing exploits the polyhedral structures. The numerical stage uses ...
متن کاملThe Method of Gauss-Newton to Compute Power Series Solutions of Polynomial Homotopies
We consider the extension of the method of Gauss-Newton from complex floating-point arithmetic to the field of truncated power series with complex floating-point coefficients. With linearization we formulate a linear system where the coefficient matrix is a series with matrix coefficients, and provide a characterization for when the matrix series is regular based on the algebraic variety of an ...
متن کاملCertified predictor-corrector tracking for Newton homotopies
We develop certified tracking procedures for Newton homotopies, which are homotopies for which only the constant terms are changed. For these homotopies, our certified procedures include using a constant predictor with Newton corrections, an Euler predictor with no corrections, and an Euler predictor with Newton corrections. In each case, the predictor is guaranteed to produce a point in the qu...
متن کاملRegenerative cascade homotopies for solving polynomial systems
A key step in the numerical computation of the irreducible decomposition of a polynomial system is the computation of a witness superset of the solution set. In many problems involving a solution set of a polynomial system, the witness superset contains all the needed information. Sommese and Wampler gave the first numerical method to compute witness supersets, based on dimension-by-dimension s...
متن کاملSolving Real Polynomial Systems with Real Homotopies
When a real homotopy is used for solving a polynomial system with real coefficients, bifurcation of some of the homotopy paths at singular points is inevitable. The main result of this paper shows that, generically, the solution set of a real homotopy contains no singular point other than a finite number of quadratic turning points. At a quadratic turning point, the bifurcation phenomenon is qu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2000
ISSN: 0747-7171
DOI: 10.1006/jsco.1999.0296